Sums of Independent Random Variables on Partially Ordered Sets

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Sums Over Partially Ordered Sets

We establish a general theorem for reducing sums of type ∑ y≥x g(y) where g is a mapping from a partially ordered set into an abelian group. Conclusions concern the Möbius function, the principle of inclusionexclusion, the Tutte polynomial and Crapo’s beta invariant.

متن کامل

Tripled partially ordered sets

In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.

متن کامل

Estimating Sums of Independent Random Variables

The paper deals with a problem proposed by Uriel Feige in 2005: if X1, . . . , Xn is a set of independent nonnegative random variables with expectations equal to 1, is it true that P ( ∑n i=1 Xi < n + 1) > 1 e ? He proved that P ( ∑n i=1Xi < n + 1) > 1 13 . In this paper we prove that infimum of the P ( ∑n i=1Xi < n + 1) can be achieved when all random variables have only two possible values, a...

متن کامل

Sampling of Multiple Variables Based on Partially Ordered Set Theory

We introduce a new method for ranked set sampling with multiple criteria. The method relaxes the restriction of selecting just one individual variable from each ranked set. Under the new method for ranking, units are ranked in sets based on linear extensions in partially order set theory with considering all variables simultaneously. Results willbe evaluated by a relatively extensive simulation...

متن کامل

Searching in Random Partially Ordered Sets

We consider the problem of searching for a given element in a partially ordered set. More precisely, we address the problem of computing efficiently near-optimal search strategies for typical partial orders. We consider two classical models for random partial orders, the random graph model and the uniform model. We shall show that certain simple, fast algorithms are able to produce nearly-optim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Probability

سال: 1974

ISSN: 0091-1798

DOI: 10.1214/aop/1176996556